Method and mechanism for implementing tessellation-based routing

ABSTRACT

Disclosed are methods and mechanisms for implementing tessellation-based processing of an integrated circuit design. Tessellation based routing of objects on an integrated circuit layout can be performed by identifying a spacing rule for tessellating at least a portion of the integrated circuit layout, forming one or more plane figures in the tessellation having one or more edges compliant with the spacing rule, the edges of the one or more plane figures forming a contour derived from a shape of a blockage object, and identifying a routing path along at least part of the one or more edges. Packing and pushing of objects may be performed using this approach.

BACKGROUND

The invention relates to a method and mechanism for designing, placing, and routing an integrated circuit (“IC”).

An IC is a small electronic device typically formed from semiconductor material. Each IC contains a large number of electronic components, e.g., transistors, that are wired together to create a self-contained circuit device. The components and wiring on the IC are materialized as a set of geometric shapes that are “placed and routed” on the chip material. During placement, the location and positioning of each geometric shape corresponding to an IC component are identified on the IC layers. During routing, a set of routes are identified to tie together the geometric shapes for the electronic components.

For many designers, a goal of the IC design process is to place as many components as possible within the smallest possible area on an IC chip. A number of advantages exist by being able to place greater densities of components on the chip. For example, squeezing more components onto a chip allows smaller chips to be made, increasing the number of chips from a given production run as compared to larger chip sizes. In addition, increasing the density of components on an IC allows a greater number of the components to be placed on the chip, which facilitates an increase in chip functionality.

Consider the process to place and route a chip. A typical problem faced by the designer (or the designer's electronic design automation (“EDA”) tool) is how to place shapes on the chip or route wires through the chip when there are already existing objects and wires on the chip floorplan. In many cases, the designer is able to identify the most efficient path/location to route a wire or to place a shape, but is unable to place/route in that location because that exact position on the chip is already occupied by other shapes or wires. Even if the exact location on the chip is unoccupied, design/manufacturing rules may not allow the designer to locate an object in that location. Moreover, even if sufficient space is available and can legally allow placement/routing of an object, many EDA tools cannot efficiently identify the optimal way to place/route objects in the space close to other objects to maximize density of components. The solution in many cases is to move the shape to an alternate and possibly less preferred location or to route the wire through another path, which may be an inefficient and more convoluted path.

SUMMARY

The present invention provides methods and mechanisms for implementing tessellation-based processing of an integrated circuit design. In an embodiment, tessellation based routing of objects on an integrated circuit layout is performed by identifying a spacing rule for tessellating at least a portion of the integrated circuit layout, forming one or more plane figures in the tessellation having one or more edges compliant with the spacing rule, the edges of the one or more plane figures forming a contour derived from a shape of a blockage object, and identifying a routing path along at least part of the one or more edges. Packing and pushing of objects may be performed using this approach. Other and additional objects, features, and advantages of the invention are described in the detailed description, figures, and claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIGS. 1 a–d show example approaches for implementing space tiles;

FIG. 2 shows a flowchart of an embodiment of a process for performing tessellation-based routing;

FIG. 3 illustrates an example of tessellation-based routing according to an embodiment of the invention.

FIG. 4 illustrates an example of tessellation-based routing with multiple blockages according to an embodiment of the invention.

FIG. 5 illustrates an example of tessellation-based routing with enclosing windows according to an embodiment of the invention.

FIG. 6 illustrates an example of tessellation-based routing with an expanded clearance distance according to an embodiment of the invention.

FIG. 7 generally illustrates the process of packing;

FIG. 8 shows a flowchart of an embodiment of a process for space tile based packing.

FIGS. 9, 10, 11 a–b, 12, and 13 show illustrated examples of a process for space tile based packing according to embodiment(s) of the invention.

FIG. 14 shows an object being placed at a location already occupied by another object.

FIG. 15 shows a flowchart of an embodiment of a process for space tile based pushing.

FIGS. 16 a–j show an illustrated example of a process for space tile based pushing according to an embodiment of the invention.

DETAILED DESCRIPTION

The present invention provides embodiments for a method and mechanism in which space tiles are employed to identify available locations to route wires or place objects in an integrated circuit design.

Space Tile Overview

A set of space tiles is formed by tessellating an area within an IC design. A space tile corresponds to a plane figure in the tessellation. In one embodiment, the contours of some or all of the space tiles are derived from or are based upon the shapes of existing objects in the tessellated area. “Free” space tiles refer to space tiles which are presently unoccupied. “Used” space tiles refer to space tiles that are occupied by one or more objects. An example of a product that identifies free space tiles in a design is the IC Craftsman product, available since at least 1998 from Cooper and Chyan Technology, now owned and distributed by Cadence Design Systems, Inc. of San Jose, Calif. The IC Craftsman product uses free space tiles to identify a possible location for a via and to identify a pin's ability to escape to a certain boundary.

Various approaches can be employed to form space tiles on a chip. One example approach is to identify the edges of existing objects within a window, and extending those edges (e.g., using hyper-planes) to define boundary lines within the window. These boundary lines become the borders of spaces tiles within the window. FIG. 1 a illustrates this approach for forming space tiles using the boundaries of existing shapes within a chip portion. In FIG. 1 a, an existing shape/object 204 is located in a window 202. Object 204 is shaped such that it includes a top edge 208, bottom edge 212, left edge 206, and right edge 210. Throughout this document, orientation-related terms such as “top”, “bottom”, “left”, and “right” are used to provide a thorough explanation of the invention—it is noted that no intent is intended by these terms to limit the scope of the invention except as specifically stated in the claims.

As shown in revised window 202 a, each of the edges 206, 208, 210, and 212 on object 204 are extended in both directions until they reach the edge/boundary of the window 202 a or another object. These edge extensions form boundary lines in the window 202 a. Thus, edge 206 is extended to form boundary line 220. Similarly, edge 208 is extended to form boundary line 224, edge 210 is extended to form boundary line 222, and edge 212 is extended to form boundary line 226. If window 202 a contains additional shaped objects, this process repeats for each additional object in the window.

A space tile corresponds to each portion of window 202 a bounded by a set of boundary lines, or bounded by boundary lines and the edge of the window 202 a. Thus, space tile 230 corresponds to the portion of window 202 a bounded by boundary line 220, boundary line 224, left window edge 260, and top window edge 262. Space tile 232 corresponds to the portion of window 202 a bounded by boundary line 224, boundary line 220, boundary line 226, and left window edge 260. In a similar manner, space tiles 234, 236, 238, 240, 242, and 244 correspond to the various boundary lines and window edges shown for window 202 a. Note that each of these space tiles 230–244 are vacant of any shapes or objects. Since these space tiles are presently empty, they are considered free space tiles eligible to receive additional objects or shapes.

Object 204 is entirely bounded by boundary lines (boundary lines 220, 222, 224, and 226). The region bounded by these boundary lines itself forms a space tile 246, which is entirely occupied by object 204. Since space tile 246 is completely filled by object 204, it is considered a used space tile that is not eligible to receive any additional objects or shapes.

The dimensions of the space tiles can be adjusted to allow compliance with design and manufacturing rules. Since one reason for identifying free space tiles is to identify regions of the chip that are available to locate additional objects, the dimensions of the space tiles may be adjusted to ensure that placing an object in the free space tile will not create a conflict, e.g., a design rule checking (“DRC”) violation, with other existing objects on the layout.

Referring to FIG. 1 b, shown is the window 202 a containing the free space tiles 230, 232, 234, 236, 238, 240, 242, and 242 that were created surrounding object 204 and its corresponding used space tile 246 in FIG. 1 a. Without taking design rules into account, each of the free space tiles 230–244 directly abut the used space tile 246, since the only consideration taken to this point to form the free space tiles has been to identify the exact exterior dimensions of the object 204.

To comply with design rules, a fence can be created around object 204 that identifies a surrounding distance in which other objects cannot be placed. Thus, boundary lines 220, 222, 224, and 226 are shifted by a given clearance distance away from the edges of object 204, as shown in window 202 b. As before, the boundary lines form the boundaries of the resultant space tiles in the window 202 b. Thus, it can be seen that used space tile 246 now includes a fence around object 204 that is not actually occupied, but is considered “used” to prevent other objects from being placed within that region in a way that would violate design or manufacturing rules.

Once the free space tiles have been established, some or all of the free space tiles can be combined into larger free space tiles. Referring to FIG. 1 c, it can be seen that free space tiles 230, 232, and 24 have been combined into a single large free space tile 263 along the left portion of the window 202 c. Similarly, free space tiles 240, 242, and 244 have been combined into a single large free space tile 265 along the right portion of window 202 b.

Alternatively, these larger free spaces 263 and 265 are initially created when the free space tiles are identified, such that the breakup of space in the area of window 202 is not symmetric. This allows the tiles in one area (i.e., free space tiles 263 or 265) to extend all the way to the edges of the used space tile 246, but tiles in other areas do not, i.e., free space tiles 236 and 238. In one embodiment, this is considered “preferred vertical” fracturing that can be used on a layer with preferred vertical routing. In an embodiment, the preferred fracturing direction of each layer is controllable and optional.

The process of tessellating a chip portion or area into space tiles can also be referred to as space tile “punch.” During the punch process, identification is made of all the shapes that affect the area and which affect the formation of space tiles. In one approach, punching a shape leaves a hole in the tile area where the shape being punched is located. Alternatively, the used space tiles can be left behind.

When performing a punch against an object, this action identifies free space tiles against a version of the window in which the object does not appear since the object is possibly being moved. Referring to FIG. 1 d, shown is a window 272 a containing object 276 and object 274. Consider if it is desired to perform a space tile punch against object 276, i.e., to determine the free space tiles in window 272 a with respect to object 276.

Revised window 272 b shows the result of performing a space tile punch against object 276. As previously noted, the space tile punch operation determines the free space tiles after the subject object has been removed from consideration. After removing object 276, only object 274 remains as a show in window 272 b. Thus, the free space tiles are identified based upon the contours of object 274. Here, the result of the space tile punch is a first free space tile 278 along the left edge of the window 272 b and a second free space tile 279 along the right edge of window 272 b. Note that these free space tiles do not extend directly against the remaining object 274. For the purposes of performing the punch operation, object 274 is considered an obstruction, and the free space tiles are adjusted to ensure compliance with distance requirements for the design rules. Thus, the boundaries of free space tiles 278 and 279 are adjusted away from object 274 to a clearance distance corresponding to DRC correctness requirements. Free space tiles 278 and 279 now identify the boundaries (with respect to object 276) of the locations/paths at which object 276 can be permissively moved within window 272 b. Revised window 272 c shows an inverted view in which the entire region that is considered unavailable is shown as a used space tile 281.

The examples of FIGS. 1 a–d illustrate one approach for identifying orthogonal space tiles. It is noted that a similar approach can also be used to form non-orthogonal space tiles, if non-rectangular shapes exist in the region of interest on the chip. Further details of an exemplary approach for implementing space tales is disclosed in co-pending U.S. application Ser. No. 10/342,863, entitled “Non-Orthogonal Structures and Space Tiles For Layout, Placement and Routing of an Integrated Circuit”, filed concurrently herewith, which is hereby incorporated by reference in its entirety.

Space-Tile-Based Routing

One application for space tiles is to identify possible wire routes in an IC design. As noted above, specified portions of an IC design can be tessellated into identified regions of free and used space tiles. Spacing rules are applied to ensure that an object can legally be placed in the free space tiles without violating design rules. By appropriately defining the location and configuration of the free space tiles, routing paths can be identified along the free space tiles for wires in the design. In one embodiment, the boundary lines of the free space tiles are used to show the permissible boundaries of locations for the centerline of objects (e.g., wires) that can be placed at or through the free space tiles. Thus, the boundary lines actually form a “clearance shadow” that is the clearance distance plus half the width of the object that is to be placed. In other words, the boundaries of the free space tiles are identified such that an object can be permissively moved with its centerline overlaid on the free space tile boundary without causing a conflict with an existing object.

FIG. 2 shows a flowchart of an embodiment of a process for implementing this functionality, in which the edges of the free space tiles are configured such that they inherently mark legal routing paths for the centerline of a wire. In this approach, if the contour of the free space tile is configured based upon the shape of a blockage and minimum spacing rules are applied, then a routing path defined by the outline of the free space tiles closest to a blockage essentially provides the closest legal path that can be taken to the blockage.

At 191, an identification is made of the window of interest in which it is desired to locate a routing path. At 192, the appropriate spacing rule is identified for the edge of the free space tiles to be formed in the window. The spacing rule for one embodiment of this approach is configured to form a minimum fence around blockages comprising half the width of the contemplated wire plus the appropriate clearance distance to avoid design rule violations. Based upon the established spacing rule, free space tiles are formed having appropriate contours and edge spacing related to one or more blockages (193). Because the spacing rule has been applied, the outline of the free space tiles adjacent to the blockage are now guaranteed to provide a legal routing path for a wire having the contemplated wire width. Therefore, a routing path can be identified along the edges of the free space tiles (195). Note that the edges of the free space tiles therefore inherently provide legal routing paths for a contemplated wire, as a result of defining the outline of the free space tiles.

FIG. 3 illustrates an example of this approach for identifying a routing path. A blockage 352 is shown along the left side of the window 350. Consider if it is desired to identify the closest legal routing paths that can be established with respect to blockage 352 for a wire 354 having a width W.

As shown in window 350 a, to ensure that the contours of free space tiles follow the contour of blockage 352, boundary lines 358, 356, and 360 are established that follow the shape of the top edge 361, right edge 363, and bottom edge 365 of blockage 352. These boundary lines 358, 356, and 360 (in combination with the edges of the window 350) define the location and contour of free space tiles 351, 353, 355, 357, and 359. A spacing rule is applied that creates a minimum space of one-half the wire width (½ W) plus a specified clearance distance (CD) between the obstruction and the boundary of the adjacent free space tiles.

The boundary lines 356, 358, and 360 along the contour of the free space tiles 351, 355, 359 adjacent to blockage 352 provide possible legal routing paths for wire 354. In particular, these boundary lines identify locations for which the centerline of wire 354 can legally be routed without violating design rules. As depicted in window 350 b, if a wire 354 a is routed with its centerline along boundary line 358, the minimum clearance distance CD is maintained between wire 354 a and blockage 352. Similarly, if wires 354 b or 354 c are routed with its centerline along boundary line 356 or 360, the minimum clearance distance CD would still be maintained between wires 354 b and 354 c and blockage 352.

When multiple punch operations are performed against multiple blockages, the border(s) of the resulting free space tiles identify the available legal routing path(s) against the entire set of blockages. Referring to FIG. 4, shown is a window 370 containing two blockages 372 and 390. Consider if it is desired to identify the closest legal routing paths that can be established with respect to blockages 372 and 390 for a wire 374 having a width W.

As shown in window 370 a, to ensure that the contour of free space tiles follow the contour of blockage 372, boundary lines 376, 378, 379, 380, and 371 are established that follow the shape of the top edge 381, right edge 383, and bottom edge 385 of blockage 372 as well as top edge 382 and left edge 384 of blockage 390. These boundary lines 376, 378, 379, 380, and 371 (along with the edges of the window 350) define the location and shapes for free space tile 392 a–h. A spacing rule is applied that creates a minimum space of one-half the wire width (½ W) plus a specified clearance distance (CD) between the blockages 372 and 390 and the boundary of their adjacent free space tiles. It is noted that in this example, empty space exists to the right and bottom of blockage 390 but no free space tiles have been identified in those areas of window 370 a. This is because those empty spaces are too small to fit free space tiles once the appropriate spacing rule has been applied. Therefore, those areas do not contain enough space that can legally fit any additional wires or other objects, and are therefore not identified as free space tiles.

Merge operations may be performed against the space tiles. One possible reason for performing a merge operation is to reduce the number of free space tiles that are processed to identify appropriate contours for routing. As shown in the revised window 370 b, free space tiles 392 b, 392 c, 392 d, and 392 e have been merged into a single free space tile.

As depicted in window 370 c, the boundary lines 376, 378, 379, 380, and 371 along the contour of the free space tiles adjacent to blockages 372 and 390 provide possible legal routing paths for wire 374. In particular, these boundary lines identify the closest possible locations to the obstructions for which the centerline of wire 374 can legally be routed without violating design rules. As can be seen, multiple possible routing paths and path segments have been identified along the edges of the free space tiles.

An enclosing window may be introduced to limit the extent of the free space tiles, and thus confine the resulting routing paths within a desired area of the design. Referring to FIG. 5, shown is a portion of an integrated circuit design 550 that contains a blockage 552. An enclosing window 540 has been introduced to limit the extent of boundaries for any free space tile that may be formed against blockage 552.

As before, consider if it is desired to identify the closest legal routing paths that can be established with respect to blockage 552 for a wire 554 having a width W. As shown in window 550 a, to ensure that the contour of free space tiles follow the contour of blockage 552, boundary lines 558, 556, and 560 are established that follow the shape of the top edge 561, right edge 563, and bottom edge 565 of blockage 552.

Here, the extent of the boundary lines ends at the border of the enclosing window 540, forming another boundary line 543. These boundary lines 558, 556, and 560 (along with boundary line 543) define the location and shapes for the resulting free space tiles as well as the possible legal routing paths for wire 554. Therefore, as shown in 550 b, applying the enclosing window 540 in this example has restricted the identified routing paths to only the left side of 550 a. Another enclosing window 542 encompasses the right portion of 550. The disclosed process may be applied against either or both enclosing windows 540 and 542.

The spacing rules may be modified to accomplish desired placement and routing effects in the design. An example of a desired effect that can be accomplished is to increased the minimum spacing between blockages and the outline of their adjacent free space tiles to spread wires in the design, e.g., to reduce crosstalk or to eliminate excessive open space. To illustrate, shown in FIG. 6 is a window 600 containing two blockages 602 and 604. Window 600 a-1 shows the formation of free space tiles in which a spacing rule has been applied to locate the contour of the adjacent free space tiles a minimum clearance distance away from the blockages. If the spacing rule specifies that only a minimum clearance distance is to be formed for these free space tiles, then when wires 606 and 608 are routed through the design, the paths for these wires 606 and 608 are the closest possible distance to blockages 602 and 604.

This creates a large open space 605 between wires 606 and 608. This large open space 605 is desirable if the design intends to place additional objects or wires within window 600 a-2. However, if no additional objects are to be placed in large open space 605 in window 600 a-2, then additional corrective action may need to be taken to avoid manufacturing defects in the IC due to excessive amounts of empty space in the design, e.g., by placing metal-fill in the large open space 605.

When forming the contours of free space tiles, the spacing rules may be adjusted to eliminate this type of open spaces and to spread wires in the design. As shown in window 600 b-1, the contours of free space tiles adjacent to blockages 602 and 604 have been adjusted by an expanded clearance distance that is larger than the minimum clearance distance. The expanded clearance distance can be selected to locate the available routing paths anywhere that is legal in the design. If it is desired to eliminate excessive open space, then the expanded clearance distance will provide more uniform and/or less excessive spacing for wires routed along the outline of free space tiles. In addition, expanded spreading of wires can be used to reduce the effects of crosstalk in the design.

Window 600 b-2 shows vertical wires 610 and 612 routed along of the border of the adjacent free space tile(s) at the expanded clearance distance relative to blockages 602 and 604. Here, it can be seen that spaces 614, 616, and 618 have been formed between the blockages 604 and 602 and the wires 610 and 612. Spaces 614, 616, and 618 are more uniform and less excessive than the large open space 605 shown in window 600 a-2.

The specified clearance distance can be adjusted in specific directions to enable spreading in desired directions. For example, expanded offsets can be applied to clearance distances only in the east-west directions, to ensure spreading only in those directions but not in the north or south directions.

Other placement and routing effects may be effected by adjusting the spacing rules. For example, permissible wire widths may be manipulated to allow wires to be routed through free space tiles that are smaller than formal design rule requirements, but which are acceptable from a performance perspective, e.g., to form neck down wires.

Any routing/placement applications may be performed using the present space tile approach. As described in more detail below, examples of particular routing/placement applications include “packing” and “pushing” of wires and components in the design.

Space Tile Pack

One application of using space tiles to identify a legal routing path is to provide a method and mechanism in which space tiles are employed to implement object packing for an integrated circuit. The objective is to move one or more objects to accomplish more efficient space utilization of the region inhabited by the objects on the chip. Space tiles are used to facilitate movement of the objects.

With reference to FIG. 7, a portion 100 of an IC design is shown. A wire segment 102 extends through the middle of chip portion 100. This leaves portions 108 and 110 available on either side of wire segment 102 for placement/routing of other objects. Consider if the designer would like to place an object 120 within chip portion 100. Here, object 120 cannot be placed into chip portion 100 because no available space exists that is large enough to fit this object. To illustrate this, assume that outline 122 shows object 120 being overlaid onto available portion 108 in chip portion 100. It can be seen that object 120 would extend beyond the boundaries of available portion 108. Similarly, outline 124 shows object 120 being overlaid onto available portion 110 in chip portion 100. Here, object 120 would also extend beyond the boundaries of available portion 110. When packing is employed, wire segment 102 is moved to an edge of chip portion 100, e.g., edges 104 or 106 of chip portion 100. Moving wire segment 102 from the middle of chip portion 100 to an edge will create greater open space which can expectantly be used to locate larger objects. For example, modified chip portion 100′ shows the result if wire segment 102 is packed along left edge 104. This movement creates a larger open space 130, which is now large enough to fully hold object 120. Similarly, modified chip portion 100″ shows the result if wire segment 102 is packed along right edge 106. This movement also creates a larger open space 132, which is large enough to fully hold object 120.

FIG. 8 shows a flowchart of a process for space-tile based packing according to an embodiment of the invention. In one embodiment, packing always occurs along the same edge or packing direction of a window. A selection may be performed to determine which direction packing is performed. Generally, if wires are the main objects to be packed, packing occurs along an edge of the window running parallel to the routing direction. For clockwise packing, if the routing direction is vertical top-down, the wires and other movable objects would be packed against the right edge of the window. For counter-clockwise packing, the wires and other movable objects would be packed against the left edge of the window. In an alternate embodiment, objects can be packed in multiple directions within the window, e.g., against two or more different window edges.

At 301, an identification is made for the window of interest. Any appropriate partitioning or tessellation approach may be used to define the window of interest. In addition, any suitable granularity may be employed to define the size and scope of the window of interest.

At 302, for each layer of interest, an identification is made of an object to move. If multiple objects in a window are eligible to be packed, the objects within in the window can be processed in an order determined by the distance of the object to the edge identified for packing. For example, the closest eligible object to the edge in the packing direction is packed first, then the next closest eligible object, etc. With respect to eligibility of an object for packing, certain objects or categories of objects can be excluded from the packing process. For instance, a designer may designate power or ground nets as “fixed” and therefore not subject to the packing process. In one embodiment, all wires are subject to packing, except those specifically designated as being fixed. Other and additional objects, in addition to wires, can also be designated as being eligible for packing.

With respect to the identified object to move, a space tile punch is performed to identify eligible locations to which the object can be moved. At 304, a first action of the punch process is to determine the free space tile(s) in the window that is available for holding more geometric shapes. Since the identified object is possibly being moved, this action of identifying free space tiles is performed against a version of the window in which the object does not appear. To ensure that movement of the object is DRC correct, the free space tiles can be adjusted to account for design rule correctness. For example, a fence or offset can be located around each obstruction, and the dimensions of the free space tile is adjusted to account for the fence or offset.

The next action is to determine whether the free space tile(s) have sufficient space to contain the object in the desired direction for movement (306). In one approach, the free space tile will not be considered “free” unless it has sufficient space for storing the object, subject to DRC rules. Thus, the border of the free space tile can be established to identify the furthest dimensional location available for placement by the object to be moved. The free space can be configured to show the centerline of the wire or object to be moved, i.e., the border of the free space tile is specified such that it marks the eligible movement location for the position of the centerline of the object being moved. Objects outside of the window can be considered to identify the available movement locations for the object, e.g., to determine how close to a window edge the object can be moved.

If available space exists for the object in the direction of desired movement, then the object is moved in the desired packing direction (312). In one embodiment, the object to be moved is moved along the edges of the free space tiles such that the movement/routing path of the object is along the edges of the free space tiles furthest towards the desired packing direction. Otherwise, the object is not moved (310). In an alternate embodiment, if the object cannot be moved in the desired packing direction, another direction of movement is checked to see if efficient packing can still occur in another packing direction. A determination is made whether there exists other objects to move (312). If so, the process returns to 302 to process the additional objects.

If there are no further objects to move in the layer, then a determination is made whether there is an additional layer to process (314). If so, then the process returns to 302 to process the object(s) in the additional layer. Otherwise, the process ends. In one embodiment, an enclosing window may be used to confine the extent and direction of packing.

FIG. 9 illustrates a first example of a packing process according to an embodiment of the invention. Shown is a window 402 containing a wire segment 404. Consider if it is desired to pack wire segment 404 in the direction of window edge 403 (to the left edge of the window).

First, a space tile punch is performed to identify the available locations within window 402 to move wire segment 404. Referring to window 402′, this demonstrates the presently embodied approach to determine the free space tile(s) for moving wire segment 404. The object to be moved (wire 404) is removed from the window 402′ when making the identification for free space tiles. Once wire 404 has been removed, the free space tile(s) for the window 402′ is determined. Here, since there are no other objects in the window, a single free space tile 406 is created which essentially covers the entire window.

In the present embodiment, the border of the free space tile corresponds to the centerline of the available location to move the object. The boundaries of the free space tile are adjusted to ensure that design rules are not violated when the object is moved to the space tile. Objects in neighboring windows can be considered when determining the boundary of the free space tile. Here, an object 410 exists in the neighboring window to the left of window 402′. Thus, the left boundary 405 of free space tile 406 is shifted away from object 410 for a distance corresponding to correct design rule requirements.

Once the correct boundaries have been established for the free space tile 406, the object to be moved is shifted as far as possible in the desired direction of movement. Referring to window 402″, the wire segment 404′ is shown packed against the left edge 403 of the window. This packing process has now created a large open space 407 along the middle and right side of window 402″. It is noted that when an object is moved, e.g., wire 404′, the start and end points of the moved object may be projected to ensure that it properly connects to connecting structures in other windows, unless those connecting structures are also shifted correspondingly to the movement of the moved object.

FIG. 10 depicts a similar example to that shown in FIG. 9, in which a window 412 contains a wire segment 414. Again, it is desired to pack wire segment 414 against the left edge of window 412. Unlike the example of FIG. 9, the left-neighboring window does not have an object near the left edge of window 412. Thus, the free space tile 416 identified by performing a space tile punch for wire segment 414 extends over the entire window, and does not need to be adjusted inward to comply with DRC checking requirements. When wire segment 414′ is packed against the left edge of window 412, it can be seen that in this example, a portion of wire segment 414′ also extends into the neighboring window. This is permissible since, as noted previously, there is no nearby object in the neighboring window that would cause a DRC violation if wire segment 414′ is partially routed through that neighboring window.

FIGS. 11 a and 11 b illustrate an example of the present embodiment of the packing process when packing multiple objects within a window. Window 422 a in this example contains wire 426 and wire 424. Consider if it is desired to pack the wires along the left edge of window 422 a. The ordering of objects to move is selected such that the object closest to the desired direction of movement is processed first. Thus, since wire 426 is closer to the left edge than wire 424, wire 426 is processed first.

Revised window 422 b shows the result of performing a space tile punch against wire 426. As previously noted, the space tile punch operation determines the free space tiles after the subject object has been removed from consideration. The result of this operation is a first free space tile 428 along the left edge of the window 422 b and a second free space tile 429 along the right edge of window 422 b. Note that these free space tiles do not extend directly against the other wire 424. For the purposes of performing the punch operation, wire 424 is considered an obstruction, and the free space tiles are adjusted to ensure compliance with distance requirements for the design rules. Thus, the boundaries of free space tiles 428 and 429 are adjusted away from wire 424 to a distance corresponding to DRC correctness requirements.

Since the desired packing direction is towards the left edge of the window, the wire 426 will be moved to the left side boundary of free space tile 428. The result of this movement is shown in window 422 c, in which packed wire 426′ now resides along the left edge of the window.

Referring to FIG. 11 b, the next step is to pack the remaining wire 424. A space tile punch is performed to identify the free space tile 430 corresponding to the removal of wire 424 from the window. This results in the free space tile 430 shown in window 422 d. It is noted that previously moved wire 426′ forms an obstruction along the left edge of window 422 d. Thus, the boundary of free space tile 430 is affected by the position and shape of wire 426′. In particular, the edge contours of wire 426′ determines the contours of the left edge boundaries of the free space tile 430. Moreover, DRC compliance will cause the left boundary of free space tile 430 to shift to the right to prevent a DRC violation. Once the left boundary of free space tile 430 has been appropriately established, wire 424 packed along free space tile boundary furthest in the desired packing direction. The result of this movement is shown in window 422 e, in which packed wire 424′ now resides along the left-most boundary of free space tile 430, towards the left side of window 422 e and next to packed wire 426′.

FIG. 12 illustrates another example of the present embodiment of the packing process. Window 702 a contains a wire segment 704 to be packed and it is assumed that it is desired to pack this wire against the left edge of the window. Window 702 a also contains an obstruction 706 that should not be moved.

The first step is to space tile punch the object to be moved. As shown in window 702 b, free space tiles are identified in the window (after the wire 704 has been removed). To ensure compliance with applicable design rule requirements, a fenced distance is formed around the obstruction. The boundaries of the space tiles in window 702 b are shifted to ensure that design rules will not be violated if the wire 704 is shifted to the boundary of the free space tiles. This may cause enough shifting such that a space tile that is “technically” free is no longer eligible to receive the object to be moved, and hence is no longer considered free. Here, it is noted the region to the left of obstruction 706 would normally contain a space tile. However, since design rules are being inherently enforced based upon the boundary of the free space tiles, no free space tile is formed in this example to the left of obstruction 706 since there is insufficient space in that region of the window to locate the wire and still meet design rule requirements.

Once the proper boundaries of the free space tiles have been established, the wire 704′ is routed along the edges of the free space tiles such that the routing path is along the edges of the free space tiles furthest towards the desired packing direction. The result of this packing process is shown in window 702 c, in which packed wire 704′ is shown following the left-most edge of the various free space tiles in the window.

FIG. 13 illustrates a further example of the present embodiment of the packing process. Here, window 802 a contains a wire segment 804 to be packed and it is assumed that the desired direction is towards the left edge of the window. Window 802 a also contains an obstruction 806 that should not be moved.

A space tile punch is performed against wire 804 to determine the available locations to move this wire segment. As shown in window 802 b, free space tiles are identified are identified to the left, right, above, and beneath the obstruction 806. It is noted that like the example of FIG. 12, a fenced distance is formed around the obstruction to ensure compliance with design rule requirements. This causes the free space tiles to be somewhat offset from the border of obstruction 806. Unlike the example of FIG. 12, the obstruction is far enough from the left edge of the window to allow a free space tile to exist to the left of the obstruction.

Once the proper boundaries of the free space tiles have been established, the wire 804′ is routed along the edges of the free space tiles such that the routing path is along the edges of the free space tiles furthest towards the desired packing direction. In one embodiment, objects are permitted to “jump” over other objects to move in the desired packing direction. Here, wire 804 would need to jump over obstruction 806 to be packed as far as possible in the desired packing direction. The result of this packing process is shown in window 802 c, in which packed wire 804′ is shown following the left-most edge of the various free space tiles in the window.

Space Tile Push

Another application of using space tiles to identify a legal routing path is to provide a method and mechanism in which space tiles are employed to implement object push for an integrated circuit.

Referring to FIG. 14, consider another problem that may arise during the chip design process. Shown is a chip portion 152 containing a wire segment 154. For any number of reasons, the designer or EDA design tool may need to insert an object 156 at an exact location in the chip portion 152, even if that location is presently inhabited by wire segment 154. In some cases, packing, e.g., space tile-based packing, may be employed to shift wire segment 154 to either edge of the chip portion 152, leaving enough open space to place the object 156. However, the circuit design may be such that it is particularly desired to keep the wire segment as much as possible along its original path. If this is the case, then the act of packing the wire segment to either edge of the chip portion may, in fact, change the wire segment's path too extensively, beyond what is desired or necessary for the chip design. Here, it may be desirable to “push” the wire segment such that it is shifted only a minimum distance necessary to allow placement of object 156 while still maintaining maintain a legal routing path.

FIG. 15 shows a flowchart of a process for implementing space tile push according to an embodiment of the invention. At 1302, an identification is made of an object to be moved or rerouted. For example, with reference to FIG. 14, if it is desired to place object 156 as indicated in window 152, then an identification would be made of the object that needs to be moved or rerouted, i.e., wire 154, to allow object 156 to be placed in the desired location. For the purposes of exposition, the present process is explained with regard to moving a wire segment. Therefore, terminology employed for this explanation is used to describe “rerouting” the wire to establish a new “path”. However, this terminology is merely illustrative, and it is noted that the present process can be used to push any type of shape or object and is not to be limited to wires.

At 1304, a space tile punch is performed to determine the boundaries of the free space tiles with respect to the object being rerouted. FIGS. 1 a–d show one example approach for determining the free space tiles with respect to an object to be rerouted. The result of 1304 is a set of free space tiles and their boundary lines, which identify the boundaries of the permissible new path(s) for the object to be moved. It is noted that at least two approaches can be taken when determining free space tiles. A first approach considers other objects that may be re-routable in the window when determining the bounds of the free space tiles. The second approach does not take these other objects into consideration, on the assumption that these other objects may also need to be rerouted during the process. Either approach may be employed.

At 1305, the new path is determined for the object being rerouted. As part of action 1305, an identification is made of each pertinent path segment for the wire being rerouted (1306). The consideration of a new path for the wire segment can be made on a segment-by-segment basis to allow the new path to be as close to topology of the original path as possible. Each path segment can delineated based upon a number of factors, such as intersection points, e.g., the intersection point between the original path for the wire and the closest available path established based upon the free space tiles of 1304. Multiple segments can be collectively identified and processed, e.g., if the multiple segments are defined by a common set of intersection points.

For the path segments, the process decides between the original path segment for the wire and the new path segment identified by the free space tiles. If the original path segment is acceptable (1308), e.g., the original path segment does not present a conflict or design rule violation, then the original path segment is retained for the final wire path (1310). Otherwise, the new path segment identified from the free space tiles is used as the new path segment (1312). This process continues until the entire wire has been rerouted, i.e., until all path segments for the wire has been established from one edge of the window to the other (1314).

A determination is made whether additional objects need to be rerouted (1316). This may occur, for example, because the new object that has been pushed onto the chip layout also overlaps or causes rules violations for additional objects. In addition, this may occur because the rerouting of the first object causes an impermissible overlap or rules violation with a second object. In either case, the additional objects are also rerouted to avoid an impermissible conflict. If so, then the process returns back to 1302 to continue rerouting the additional objects. If the object to be placed on the floorplan spans multiple layers, then it is possible that the actions shown in FIG. 15 are performed on a per-layer basis, for each layer in which a conflict exists and wires are to be rerouted to avoid the conflict.

FIGS. 16 a–j provide an illustrative example of the process for implementing a space tile based push operation. FIG. 16 a shows a window containing a single wire segment 1402. Referring to FIG. 16 b, consider if it is desired to place object 1404 as shown, directly in the path of wire 1402.

Consistent with the present embodiment of the invention, the first action is to perform a space tile punch to determine the free space tiles relative to wire 1402. When making the free space tile determination, wire 1402 is removed from the window, and therefore the punch is performed relative to the contour and edges of object 1404. Referring to FIG. 16 c, boundary lines are drawn extending from each edge of object 1404. Thus, horizontal boundary line 1410 extends from the top edge of object 1404 to the right and left sides of the window. Horizontal boundary line 1412 extends from the bottom edge of object 1404 to the right and left sides of the window. Vertical boundary lines 1406 and 1408 extend from the left and right edges, respectively, of object 1404 to the top and bottom sides of the window.

As shown in FIG. 16 d, these boundary lines are shifted by a clearance distance plus one half of the width of the wire 1402 to identify the outer boundaries of the movable and permissible locations for the centerline of wire 1402. In effect, a fence is built around object 1404 to prevent any design rule violations or conflicts between the moved location of wire 1402 and object 1404. As stated above, the free space tiles can be identified only with regard for the pushed object 1404, and without immediate consideration for other objects that may exist in the window, e.g., because these other objects can also be moved if moving wire 1402 causes a conflict with these other objects. If the other objects cannot be moved, then they are obstructions that should be considered when forming the free space tiles.

At the completion of the punch process, space tiles 1414, 1416, 1418, 1420, 1422, 1424, 1426, and 1428 are identified which are bounded by boundary lines 1406, 1408, 1410, 1412, and the sides of the window (which indicates that the centerline of wire 1402 can also be moved to the sides of the windows and therefore will not cause a conflict with nearby objects in other windows).

A determination can be made of possible path locations for moving the wire 1402. Referring to FIG. 16 e, one approach for identifying possible path locations is to divide the window, e.g., by extending a line 1431 along the preferred routing direction along the center of the object 1404. Other dividing lines/locations can also be used. This line 1431 creates an enclosing window 1433 a and an enclosing window 1433 b. Free space tile 1420 is split into two free space tiles 1420 a and 1420 b, with free space tile 1420 a residing in enclosing window 1433 a and free space tile 1420 b residing in enclosing window 1433 b. Similarly, free space tile 1422 is split into two free space tiles 1422 a and 1422 b, with free space tile 1422 a residing in enclosing window 1433 a and free space tile 1422 b residing in enclosing window 1433 b.

The space tiles are used to identify a possible path for the wire 1402 in each enclosing window. In one embodiment, the identified path is packed as close as possible to object 1404. As noted above, the borders of the free space tiles identify the centerline of available locations to move the wire being punched. Thus, packing a wire or object in a desired direction is performed by identifying the borders of free space tiles as far as possible in the directed packing direction. Here, if it is desired to have wire 1403 maintain as much as possible its original topology, then in one embodiment, the desired packing direction is in the direction of the object 1404. FIG. 16 f-1 shows a possible path 1409 in enclosing window 1433 a when packing is performed in the direction of object 1404, where the path extends along the borders of free space tiles 1420 a, 1416, and 1422 a that are closest to object 1404. FIGS. 16 f-2 shows a possible path 1411 in sub-window 1433 b when packing is performed in the direction of object 1404, where the path extends along the borders of free space tiles 1420 b, 1426, and 1422 b that are closest to object 1404.

The next action is to determine the path portions for the new path for wire 1402. One method for identifying each path segment of the new path is by identifying each portion which extends to/from an intersection between legal portions of the original path and portions of the possible paths identified using the free space tiles. If the original path segment is free of conflict or rule violation, then the original path segment is retained, since this allows the new path to retain as much as possible of the original wire topology. On the other hand, if the original path segment is not usable, then an alternate path segment is selected using the free space tiles. In many cases, the alternate path segment that is most similar to the original wire topology is the path segment corresponding to the free space tile boundary line that is as close as possible to the original path or the free space tile boundary line closest to the object 1404 that has been inserted into the window.

An identification is made of the sub-window that contains the original path of the wire 1402 to be rerouted. Here, sub-window 1433 a contains the original path of the wire 1402. If desired, the dividing line 1431 can be positioned to ensure that the original path of wire 1402 is contained within a single sub-window.

FIG. 16 g shows the centerline of the original path 1430 for wire 1402 that has been overlaid over the path 1409 for enclosing window 1433 a identified in FIGS. 16 f-1. The next step is to identify the path segments for the new path that will be used to reroute wire 1402 around object 1404. The goal of the present embodiment is to identify a new path that is as close as possible to the original topology of the original path 1430 for wire 1402, while avoiding conflicts or design rule violations.

The process continues by identifying portions of the original path for wire 1402 which are legal locations that do not create conflicts. Here, it can be seen that the portion of wire 1402 extending from point 1471 to point 1473 is in a legal location and does not conflict with object 1404. As shown in FIG. 14 h, this defines a path portion 1481. The portion of wire 1402 extending from point 1477 to point 1475 also defines a legal location that does not conflict with object 1404. These points define a path portion 1483. Since these path portions 1481 and 1483 do not create a conflict or design rule violation with object 1404, then these path portions can be kept as part of the final path for wire 1402 to maintain as much as possible the original topology for wire 1402.

It can be seen that the portion of the original wire 1402 extending from point 1473 to point 1475 in conflict with object 1404. Therefore, it is this portion of the original wire that is rerouted to form the final path for wire 1402.

The intersection that occur at points 1473 and 1477 between the original path of wire 1402 and path 1409 formed from the free space tiles define the new path portions for wire 1402. As shown in FIG. 16 i, intersection points 1473 and 1475 define a path portion 1485 from path 1409. The combination of path portion 1485 with the legal path portions 1481 and 1483 define the new path for wire 1402.

As shown in FIG. 16 j, the new wire path for wire 1402 has been completely rerouted. The new path 1464 retains as much as possible the original topology of the original path for wire 1402, but also avoids conflicts and rule violations with respect to object 1404. This process can be repeated for enclosing window 1433 b to determine if the alternate path 1411 provides a more advantageous new path for wire 1402. In one embodiment, heuristics can be applied to determine which enclosing window should be processed, or processed first. For example, some factors that can be considered include which enclosing window contains the original routing path, which enclosing window will result in less movements of objects, and the number of obstructions in each enclosing window. If there are any additional objects to reroute, e.g., because either new path 1464 or object 1404 conflicts with other wire segments, then the process repeats to reroute these other objects.

CONCLUSION

Therefore, what has been described is a method and mechanism for space tile based routing and movement of objects. The present invention may be embodied as any combination of software, hardware, or manual operations. In one specific embodiment, the invention is embodied as a EDA software tool for placing and/or routing integrated circuit designs.

In the foregoing specification, the invention has been described with reference to specific embodiments thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and scope of the invention. For example, the above-described process flows are described with reference to a particular ordering of process actions. However, the exact ordering or content of the described process actions may be changed without affecting the scope or operation of the invention. The specification and drawings are, accordingly, to be regarded in an illustrative rather than restrictive sense. 

1. A method for space tile based routing for an integrated circuit layout, comprising: (a) identifying a spacing rule for forming a space tile; (b) forming one or more space tiles having one or more edges compliant with the spacing rule, the space tiles having two-dimensions, wherein edges of the one or more space tiles form a contour relating to a shape of a blockage object, and a possible routing path utilizing one possible path identified by the one or more edges, wherein the spacing rule is adjusted to move at least one of the one or more edges such that the possible routing path is located close to an original routing path and free of rules violation; (c) identifying the routing path along at least part of the one or more edges; and (d) storing the identified routing path.
 2. The method of claim 1 in which the spacing rule specifies a clearance distance added to one-half a wire width for a contemplated wire to be routed along the routing path.
 3. The method of claim 2 in which the clearance distance is a minimum distance to ensure compliance with design rules.
 4. The method of claim 2 in which the clearance distance is adjusted different from a minimum distance necessary to ensure compliance with design rules in at least one direction.
 5. The method of claim 4 in which the clearance distance is increased beyond the minimum distance to implement wire spreading.
 6. The method of claim 1 in which one or more additional blockages are considered when forming the one or more space tiles, wherein the routing path provides legal path for the blockage object and the one or more additional blockages.
 7. The method of claim of claim 1 further comprising: forming an enclosing window; restricting the extent and direction of the one or more space tiles based upon boundaries of the enclosing window.
 8. The method of claim 1 in which the routing path is identified to perform a push operation.
 9. The method of claim 1 in which the routing path is identified to perform a pack operation.
 10. The method of claim 1, wherein forming the space tiles comprises: extending the boundary edges of the blockage object until the extended edges hit another extended edge or another object.
 11. A method for tessellation-based routing for an integrated circuit layout, comprising: (a) identifying a spacing rule for tessellating at least a portion of the integrated circuit layout; (b) forming one or more planar figures in the tessellation having one or more edges compliant with the spacing rule, wherein edges of the one or more planar figures form a contour relating to a shape of a blockage object, and a possible routing path utilizing one possible path identified by the one or more edges, wherein the spacing rule is adjusted to move at least one of the one or more edges such that the possible routing path is located close to an original routing path and free of rules violation; (c) identifying the routing path along at least part of the one or more edges; and (d) storing the identified routing path.
 12. The method of claim 11 in which the spacing rule specifies a clearance distance added to one-half a wire width for a contemplated wire to be routed along the routing path.
 13. The method of claim 12 in which the clearance distance is a minimum distance to ensure compliance with design rules.
 14. The method of claim 12 in which the clearance distance is adjusted different from a minimum distance necessary to ensure compliance with design rules.
 15. The method of claim 14 in which the clearance distance is increased beyond the minimum distance to implement wire spreading.
 16. The method of claim 11 in which one or more additional blockage objects are considered when forming the one or more plane figures, wherein the routing path provides legal path for the blockage object and the one or more additional blockage objects.
 17. The method of claim of claim 11 further comprising: forming an enclosing window; restricting the extent and direction of the one or more plane figures based upon boundaries of the enclosing window.
 18. The method of claim 11 in which the routing path is identified to perform a push operation.
 19. The method of claim 11 in which the routing path is identified to perform a pack operation.
 20. The method of claim 11, further comprising: (e) identifying a new path for the object based upon the one or more edges and an original path for the object.
 21. The method of claim 20 in which (e) comprises: determining if the new path can be routed through an original path segment, wherein the original path segment forms at least part of the new path; and identifying an alternate path segment if the new path cannot be routed through the original path segment, wherein the alternate path segment forms at least part of the new path.
 22. The method of claim 21 in which the alternate path segment is identified based upon an intersection between possible path segments.
 23. The method of claim 21 in which the act of determining if the new path can be routed through the original path segment is based upon whether a conflict or design rule violation will occur.
 24. The method of claim 21 in which the spacing rule specifies a clearance distance added to one-half a wire width for a contemplated wire to be routed along the new path.
 25. The method of claim 24 in which the clearance distance is a minimum distance to ensure compliance with design rules.
 26. The method of claim 21 in which the action of (e) is based upon determining the new path to have a similar topology to an original path.
 27. The method of claim 11, further comprising: (e) determining if space is available for movement of the object in a desired packing direction corresponding to the plane figures; and (f) if the space is available in the desired packing direction, moving the object to the available space.
 28. The method of claim 27 in which the edges are configured based upon minimum distance requirements to nearby objects.
 29. The method of claim 27 in which the object can jump over another object to be moved in the desired packing direction.
 30. The method of claim 27 in which the object is moved such that it follows one or more of the edges furthest in the desired packing direction.
 31. The method of claim 27 in which the object is moved in a second packing direction if the space is not available in the desired packing direction.
 32. The method of claim 27 in which the object is a wire.
 33. The method of claim 27 in which the edges identify the centerline for eligible locations of movement for the object.
 34. The method of claim 27 in which the spacing rule specifies a clearance distance added to one-half a wire width for a contemplated object to be moved.
 35. A computer program product comprising a computer usable medium having executable code to execute a process for tessellation based routing of objects on an integrated circuit layout, the process comprising: (a) identifying a spacing rule for tessellating at least a portion of the integrated circuit layout; (b) forming one or more planar figures in the tessellation having one or more edges compliant with the spacing rule, wherein edges of the one or more planar figures form a contour derived from a shape of a blockage object, and a possible routing path utilizing one possible path identified by the one or more edges, wherein the spacing rule is adjusted to move at least one of the one or more edges such that the possible routine path is located close to an original routing path and free of rules violation; (c) identifying the routing path along at least part of the one or more edges; and (d) storing the identified routing path.
 36. The computer program product of claim 35, further comprising: (c) determining if space is available for movement of the object in a desired packing direction corresponding to the plane figures; and (d) if the space is available in the desired packing direction, moving the object to the available space.
 37. The computer program product of claim 35, further comprising: (c) identifying a new path for the object based upon the one or more edges and an original path for the object.
 38. A system for tessellation-based routing for an integrated circuit layout, comprising: (a) means for identifying a spacing rule for tessellating at least a portion of the integrated circuit layout; (b) means for forming one or more planar figures in the tessellation having one or more edges compliant with the spacing rule, wherein edges of the one or more planar figures form a contour derived from a shape of a blockage object, and a possible routing path utilizing one possible path identified by the one or more edges, wherein the spacing rule is adjusted to move at least one of the one or more edges such that the possible routing path is located close to an original routing path and free of rules violation; (c) means for identifying the routing path along at least part of the one or more edges; and (d) means for storing the identified routing path.
 39. The system of claim 38, further comprising: (c) means for identifying a new path for the object based upon the one or more edges and an original path for the object.
 40. A system for space tile based routing for an integrated circuit layout, comprising: (a) means for identifying a spacing rule for forming a space tile; (b) means for forming one or more space tiles having one or more edges compliant with the spacing rule, the space tiles having two-dimensions, wherein edges of the one or more space tiles form a contour relating to a shape of a blockage object, and a possible routing path utilizing one possible path identified by the one or more edges, wherein the spacing rule is adjusted to move at least one of the one or more edges such that the possible routing path is located close to an original routing path and free of rules violation; (c) means for identifying a routing path along at least part of the one or more edges; and (d) storing the identified routing path.
 41. The system of claim 40 in which the spacing rule specifies a clearance distance added to one-half a wire width for a contemplated wire to be routed along the routing path.
 42. The system of claim of claim 40 further comprising: means for forming an enclosing window; and means for restricting the extent and direction of the one or more space tiles based upon boundaries of the enclosing window.
 43. The system of claim 40, wherein the means for forming the space tiles comprises: means for extending the boundary edges of the blockage object until the extended edges hit another extended edge or another object.
 44. A computer program product comprising a computer usable medium having executable code to execute a process for space tile based routing for an integrated circuit layout, the process comprising: (a) identifying a spacing rule for forming a space tile; (b) forming one or more space tiles having one or more edges compliant with the spacing rule, the space tiles having two-dimensions, wherein edges of the one or more space tiles form a contour relating to a shape of a blockage object, and a possible routing path utilizing one possible path identified by the one or more edges, wherein the spacing rule is adjusted to move at least one of the one or more edges such that the possible routing path is located close to an original routing path and free of rules violation; (c) identifying a routing path along at least part of the one or more edges; and (d) storing the identified routing path.
 45. The computer program product of claim 44 in which the spacing rule specifies a clearance distance added to one-half a wire width for a contemplated wire to be routed along the routing path.
 46. The computer program product of claim 44 in which one or more additional blockages are considered when forming the one or more space tiles, wherein the routing path provides legal path for the blockage object and the one or more additional blockages.
 47. The computer program product of claim of claim 44, the process further comprising: forming an enclosing window; restricting the extent and direction of the one or more space tiles based upon boundaries of the enclosing window.
 48. The computer program product of claim 44 in which the routing path is identified to perform a push operation.
 49. The computer program product of claim 44 in which the routing path is identified to perform a pack operation.
 50. The computer program product of claim 44, wherein forming the space tiles comprises: extending the boundary edges of the blockage object until the extended edges hit another extended edge or another object. 